Endpoint Entropy Fefferman–Stein Bounds for Commutators
نویسندگان
چکیده
Abstract In this paper endpoint entropy Fefferman–Stein bounds for Calderón–Zygmund operators introduced by Rahm (J Math Anal Appl 504(1):Paper No. 125372, 2021) are extended to iterated Coifman–Rochberg–Weiss commutators.
منابع مشابه
Variance bounds, with an application to norm bounds for commutators
Murthy and Sethi (Sankhya Ser B 27, 201–210 (1965)) gave a sharp upper bound on the variance of a real random variable in terms of the range of values of that variable. We generalise this bound to the complex case and, more importantly, to the matrix case. In doing so, we make contact with several geometrical and matrix analytical concepts, such as the numerical range, and introduce the new con...
متن کاملEndpoint Bounds for a Generalized Radon Transform
We prove that convolution with arclength measure on the curve parametrized by h(t) := (t, t, . . . , t) is a bounded operator from L(R) to L(R) for the full conjectured range of exponents, improving on a result due to M. Christ. We also obtain nearly sharp Lorentz space bounds.
متن کاملSharp Bounds for General Commutators on Weighted Lebesgue Spaces
We show that if an operator T is bounded on weighted Lebesgue space L(w) and obeys a linear bound with respect to the A2 constant of the weight, then its commutator [b, T ] with a function b in BMO will obey a quadratic bound with respect to the A2 constant of the weight. We also prove that the kth-order commutator T k b = [b, T k−1 b ] will obey a bound that is a power (k + 1) of the A2 consta...
متن کاملEntropy Bounds for Traffic Confirmation
Consider an open MIX-based anonymity system with N participants and a batch size of b. Assume a global passive adversary who targets a given participant Alice with a set RA of m communicating partners. Let H(RA | Bt) denote the entropy of RA as calculated by the adversary given t message sets (MIX batches) where Alice is a sender in each message set. Our main result is to express the rate at wh...
متن کاملAn Improved Entropy-based Endpoint Detection Algorithm
It is found that the detection using basic spectral entropy becomes difficult and inaccurate when speech signals are contaminated by high noise. This paper presents an improved entropy-based algorithm. The way to compute spectral probability density function of entropy is altered by the introduction of a positive constant. The modification improves the discriminability between speech and noise ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fourier Analysis and Applications
سال: 2023
ISSN: ['1531-5851', '1069-5869']
DOI: https://doi.org/10.1007/s00041-023-10040-4